1926E - Vlad and an Odd Ordering - CodeForces Solution

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
    int t; cin>>t;
    while(t--){
        int n,k; cin>>n>>k; 
        int temp=n,mul=1;
        while(temp>0){
            int val=temp-(temp/2);
            if(val>=k){
                cout<<mul*(2*k-1)<<endl;
                break;
            }
            k-=val;
            mul*=2;
            temp=temp/2;
        }
    }
}